Caratheodory theorems in convex product structures
نویسندگان
چکیده
منابع مشابه
Caratheodory-Type Selections and Random Fixed Point Theorems
We provide some new Caratheodory-type selection theorems. i.e.. selections for correspondences of two variables which are continuous with respect to one variable and measurable with respect to the other. These results generalize simultaneously Michael’s [2l] continuous selection theorem for lower-semicontinuous correspondences as well as a Caratheodory-type selection theorem of Fryszkowski [IO]...
متن کاملFuzzy convergence structures in the framework of L-convex spaces
In this paper, fuzzy convergence theory in the framework of $L$-convex spaces is introduced. Firstly, the concept of $L$-convex remote-neighborhood spaces is introduced and it is shown that the resulting category is isomorphic to that of $L$-convex spaces. Secondly, by means of $L$-convex ideals, the notion of $L$-convergence spaces is introduced and it is proved that the category of $L$-con...
متن کاملFixed point theorems in convex metric spaces
*Correspondence: [email protected] Department of Mathematics, Bu-Ali Sina University, Hamedan, Iran Abstract In this paper, we study some fixed point theorems for self-mappings satisfying certain contraction principles on a convex complete metric space. In addition, we investigate some common fixed point theorems for a Banach operator pair under certain generalized contractions on a convex c...
متن کاملConvex structures via convex $L$-subgroups of an $L$-ordered group
In this paper, we first characterize the convex $L$-subgroup of an $L$-ordered group by means of fourkinds of cut sets of an $L$-subset. Then we consider the homomorphic preimages and the product of convex $L$-subgroups.After that, we introduce an $L$-convex structure constructed by convex $L$-subgroups.Furthermore, the notion of the degree to which an $L$-subset of an $L$-ord...
متن کاملProduct Theorems Via Semidefinite Programming
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovász to determine the Shannon capacity of the pentagon; to show a direct sum theorem for non-deterministic communication complexity and direct product theorems for discrepancy; and in interactive proof systems to show parallel repetition theorems for res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1970
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1970.35.227